package test;

class Solution {
    public int uniquePathsWithObstacles(int[][] ob) {
        //构建 dp 表
        int m = ob.length;
        int n = ob[0].length;
        int[][] dp = new int[m+1][n+1];
        //初始化
        dp[0][1] = 1;
        //填表
        for(int i = 1; i <= m; i++) {
            for(int j = 1; j <= n; j++) {
                if(ob[i-1][j-1] != 1) {
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
                }
            }
        }
        //返回值
        return dp[m][n];
    }
}

public class Demo1 {
}
